#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
int n;
int a[MAXN];

int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i <= n;i++){
        scanf("%d",&a[i]);
    }
    sort (a+1,a+n+1);
    int p = 1;
    for (int i=2;i <= n;i++){
        if (a[i] > a[p]){
            p++;
        }
    }
    int ans = n-p+1;
    printf("%d\n",ans);

    return 0;
}
